Computer and Modernization ›› 2009, Vol. 1 ›› Issue (7): 70-74.doi: 10.3969/j.issn.1006-2475.2009.07.020

• 网络与通信 • Previous Articles     Next Articles

Solving Multiple Constrains QoS Routing Based on Improved Particle Swarm Algorithm

CHI Wen-jie, CHEN Jia-qi   

  1. College of Computer Engineering, University of Shanghai for Science & Technology, Shanghai 200093, China
  • Received:2009-04-07 Revised:1900-01-01 Online:2009-07-10 Published:2009-07-10

Abstract: In multimedia network, the routing problem is subject to QoS constrains. These problems are NPcomplete. An improved particle swarm algorithm is proposed to solve the QoS routing for multiple constrains. Some methods of evolution mechanism, constructing feasible solution space and adaptive inertia weight are presented to enhance capability of algorithm searching the best global solution. Simulation results verify the proposed algorithm is effective. The algorithm gets good performance and can effectively solve QoS routing with multiple constrains.

Key words: multiple constrains, QoS routing, improved particle swarm algorithm

CLC Number: 

Copyright © Computer and Modernization, All Rights Reserved.
Tel: 0791-86490996 Fax: 0791-86492535 E-mail: jgsdd@163.com
Powered by Beijing Magtech Co., Ltd.